Extreme tournaments with given primitive exponents
نویسندگان
چکیده
Let e(Tn) be the primitive exponent of a primitive tournament Tn of order n. In this paper, we obtain the following results. 1. Let Tn be a regular or almost regular tournament of order n ≥ 7; then e(Tn) = 3. 2. Let k ∈ {n, n + 1, n + 2}. We give the sufficient and necessary conditions for Tn such that e(Tn) = k, and obtain all Tn’s such that e(Tn) = k.
منابع مشابه
On Generalized Exponents of Tournaments
We determine two types of generalized exponent sets for tournaments with given order. In the course of proving the main results we find the following result, which may be interesting in its own right: When n is large enough, almost all tournaments on n vertices have the property that there is a path of length 2 from each vertex u to each vertex v 6= u.
متن کاملScaling in Tournaments
We study a stochastic process that mimics single-game elimination tournaments. In our model, the outcome of each match is stochastic: the weaker player wins with upset probability q ≤ 1/2, and the stronger player wins with probability 1−q. The loser is eliminated. Extremal statistics of the initial distribution of player strengths governs the tournament outcome. For a uniform initial distributi...
متن کاملBound for 2-exponents of Primitive Extremal Ministrong Digraphs
We consider 2-colored digraphs of the primitive ministrong digraphs having given exponents. In this paper we give bounds for 2-exponents of primitive extremal ministrong digraphs.
متن کاملGeneralized Exponents of Primitive Symmetric Digraphs
A strongly connected digraph D of order n is primitive (aperiodic) provided the greatest common divisor of its directed cycle lengths equals 1. For such a digraph there is a minimum integer t, called the exponent of D, such that given any ordered pair of vertices x and y there is a directed walk from x to y of length t. The exponent of D is the largest of n ‘generalized exponents’ that may be a...
متن کاملTen new primitive binary trinomials
We exhibit ten new primitive trinomials over GF(2) of record degrees 24 036 583, 25 964 951, 30 402 457, and 32 582 657. This completes the search for the currently known Mersenne prime exponents. Primitive trinomials of degree up to 6 972 593 were previously known [4]. We have completed a search for all known Mersenne prime exponents [7]. Ten new primitive trinomials were found. Our results ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 28 شماره
صفحات -
تاریخ انتشار 2003